Relating the ECDLP to Other Curves Mark Bauer University of Calgary Department of Mathematics & Statistics Centre for Information Security and Cryptography

Source URL: www.fields.utoronto.ca

• Finite fields
• Analysis of algorithms
• Asymptotic analysis
• Cryptography
• Analytic number theory
• Elliptic curve
• Ample line bundle
• Big O notation
• Hyperelliptic curve cryptography
• Abstract algebra
• Mathematics
• Mathematical analysis

Constructing cryptographic curves with complex multiplication Reinier Br¨ oker Ξ

Source URL: www.fields.utoronto.ca

• Group theory
• Elliptic curves
• Analytic number theory
• Number theory
• Prime number
• Curve
• Frobenius endomorphism
• Supersingular elliptic curve
• Counting points on elliptic curves
• Abstract algebra
• Mathematics
• Finite fields

Internet Engineering Task Force (IETF) Request for Comments: 5903 Obsoletes: 4753 Category: Informational ISSN: [removed]

Source URL: www.rfc-editor.org

• Internet Key Exchange
• Diffie–Hellman key exchange
• Elliptic curve cryptography
• Hellman
• Key size
• Request for Comments
• XTR
• Oakley protocol
• Cryptography
• Cryptographic protocols
• Finite fields

t 1/3 Diffusivity of Finite-Range Asymmetric Exclusion Processes on Z Benedek Valk´o (University of Toronto) joint work with J. Quastel (U of T) March 17, 2007

Source URL: www.fields.utoronto.ca

Board of Trustees Report Southwest College December 3, 2008 Infrastructure Committee

Source URL: www.laccd.edu

• Theoretical computer science
• Applied mathematics
• Mathematics
• Finite fields
• Information theory
• Error detection and correction
• Los Angeles Unified School District
• IP
• Coding theory

A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and its Applications Emmanuel Bresson1 , Dario Catalano2 , and David Pointcheval2 1

Source URL: www.iacr.org

• Finite fields
• Electronic commerce
• Paillier cryptosystem
• Okamoto–Uchiyama cryptosystem
• Goldwasser–Micali cryptosystem
• XTR
• ElGamal encryption
• Diffie–Hellman problem
• RSA
• Cryptography
• Public-key cryptography
• Computational hardness assumptions

Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves Pradeep Kumar Mishra and Palash Sarkar Cryptology Research Group, Applied Statistics Unit, Indian Statistical Institute,

Source URL: www.iacr.org

• Finite fields
• Computational complexity theory
• Elliptic curve cryptography
• Elliptic curves
• Elliptic curve
• Hyperelliptic curve cryptography
• Multiplication
• Time complexity
• Matrix
• Abstract algebra
• Mathematics
• Cryptography

Boneh et al.’s k-Element Aggregate Extraction Assumption Is Equivalent to The Diffie-Hellman Assumption Jean-Sebastien Coron and David Naccache Gemplus Card International 34, rue Guynemer, Issy-les-Moulineaux, F-92447,

Source URL: www.iacr.org

• Public-key cryptography
• Computational hardness assumptions
• BLS
• Diffie–Hellman problem
• Digital signature
• XTR
• Parity of a permutation
• Diffie–Hellman key exchange
• Structure
• Cryptography
• Finite fields
• Cryptographic protocols

Annales Mathematicae et Informaticae[removed]pp. 145–153 http://ami.ektf.hu The rank of certain subfamilies of the elliptic curve Y 2 = X 3 − X + T 2∗

Source URL: ami.ektf.hu

• Group theory
• Analytic number theory
• Number theory
• Finite fields
• Curve
• Birch and Swinnerton-Dyer conjecture
• Hessian form of an elliptic curve
• Abstract algebra
• Mathematics
• Elliptic curves

Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology Fields Cryptography Retrospective Meeting

Source URL: www.fields.utoronto.ca

• Group theory
• Lenstra elliptic curve factorization
• Elliptic curve
• Elliptic curve cryptography
• Torsion
• Edwards curve
• Elliptic curve primality testing
• Algebraic-group factorisation algorithm
• Abstract algebra
• Finite fields
• Integer factorization algorithms